2 Linear Matrix Inequality Representation of Sets
نویسنده
چکیده
This article concerns the question: which subsets of R can be represented with Linear Matrix Inequalities, LMIs? This gives some perspective on the scope and limitations of one of the most powerful techniques commonly used in control theory. Also before having much hope of representing engineering problems as LMIs by automatic methods one needs a good idea of which problems can and cannot be represented by LMIs. Little is currently known about such problems. In this article we give a necessary condition, we call ”rigid convexity”, which must hold for a set C ∈ R in order for C to have an LMI representation. Rigid convexity is proved to be necessary and sufficient when m = 2. This settles a question formally stated by Pablo Parrilo and Berndt Sturmfels in [PSprep].
منابع مشابه
Inverse Young inequality in quaternion matrices
Inverse Young inequality asserts that if $nu >1$, then $|zw|ge nu|z|^{frac{1}{nu}}+(1-nu)|w|^{frac{1}{1-nu}}$, for all complex numbers $z$ and $w$, and equality holds if and only if $|z|^{frac{1}{nu}}=|w|^{frac{1}{1-nu}}$. In this paper the complex representation of quaternion matrices is applied to establish the inverse Young inequality for matrices of quaternions. Moreover, a necessary and ...
متن کاملLinear matrix inequality approach for synchronization of chaotic fuzzy cellular neural networks with discrete and unbounded distributed delays based on sampled-data control
In this paper, linear matrix inequality (LMI) approach for synchronization of chaotic fuzzy cellular neural networks (FCNNs) with discrete and unbounded distributed delays based on sampled-data controlis investigated. Lyapunov-Krasovskii functional combining with the input delay approach as well as the free-weighting matrix approach are employed to derive several sufficient criteria in terms of...
متن کاملMatrix Sum-of-Squares Relaxations for Robust Semi-Definite Programs
Received: date / Revised version: date Abstract. We consider robust semi-definite programs which depend polynomially or rationally on some uncertain parameter that is only known to be contained in a set with a polynomial matrix inequality description. On the basis of matrix sum-of-squares decompositions, we suggest a systematic procedure to construct a family of linear matrix inequality relaxat...
متن کاملOn the solving matrix equations by using the spectral representation
The purpose of this paper is to solve two types of Lyapunov equations and quadratic matrix equations by using the spectral representation. We focus on solving Lyapunov equations $AX+XA^*=C$ and $AX+XA^{T}=-bb^{T}$ for $A, X in mathbb{C}^{n times n}$ and $b in mathbb{C} ^{n times s}$ with $s < n$, which $X$ is unknown matrix. Also, we suggest the new method for solving quadratic matri...
متن کامل